Accelerating benders decomposition with heuristicmaster problem solutions
نویسندگان
چکیده
منابع مشابه
Accelerating Benders Decomposition with Heuristic Master Problem Solutions
In this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show t...
متن کاملAccelerating Benders Decomposition with Heuristic Master Problem Solutions
In this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show t...
متن کاملAccelerating the Composite Power System Planning by Benders Decomposition
This paper presents an application of Benders decomposition to deal with the complexities in the simultaneous Generation Expansion Planning (GEP) and Transmission Expansion Planning (TEP). Unlike the power system operation fields of study, the power system planning methods are not expected to be fast. However, it is always preferable to speed up computations to provide more analysis options for...
متن کاملAccelerating Benders Decomposition by Local Branching
Walter Rei, Michel Gendreau Département d’informatique et de recherche opérationnelle and Centre de recherche sur les transports, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, Canada, H3C 3J7, {[email protected], [email protected]} Jean-François Cordeau, Patrick Soriano HEC and Centre de recherche sur les transports, Montréal, 3000 chemin de la Côte-Sainte-C...
متن کاملAccelerating Benders decomposition for network design
Network design problems arise in many different application areas such as air freight, highway traffic and communications systems. This thesis concerns the development, analysis and testing of new techniques for solving network design problems. We study the application of Benders decomposition to solve mixed integer programming formulations of the network design problem. A new methodology for a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pesquisa Operacional
سال: 2012
ISSN: 1678-5142,0101-7438
DOI: 10.1590/s0101-74382012005000005